Spanning Forests on the Sierpinski Gasket

نویسندگان

  • Shu-Chiuan Chang
  • Lung-Chi Chen
چکیده

We present the numbers of spanning forests on the Sierpinski gasket SGd(n) at stage n with dimension d equal to two, three and four, and determine the asymptotic behaviors. The corresponding results on the generalized Sierpinski gasket SGd,b(n) with d = 2 and b = 3, 4 are obtained. We also derive the upper bounds of the asymptotic growth constants for both SGd and SG2,b.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tutte polynomial of pseudofractal scale-free web

The Tutte polynomial of a graph is a 2-variable polynomial which is quite important in both combinatorics and statistical physics. It contains various numerical invariants and polynomial invariants ,such as the number of spanning trees,the number of spanning forests , the number of acyclic orientations , the reliability polynomial,chromatic polynomial and flow polynomial . In this paper,we stud...

متن کامل

Number of connected spanning subgraphs on the Sierpinski gasket

We study the number of connected spanning subgraphs fd,b(n) on the generalized Sierpinski gasket SGd,b(n) at stage n with dimension d equal to two, three and four for b = 2, and layer b equal to three and four for d = 2. The upper and lower bounds for the asymptotic growth constant, defined as zSGd,b = limv→∞ ln fd,b(n)/v where v is the number of vertices, on SG2,b(n) with b = 2, 3, 4 are deriv...

متن کامل

Structure of spanning trees on the two-dimensional Sierpinski gasket

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...

متن کامل

Minimum 2-Edge Connected Spanning Subgraph of Certain Interconnection Networks

Given an undirected graph, finding a minimum 2-edge connected spanning subgraph is NP-hard. We solve the problem for silicate network, brother cell and sierpiński gasket rhombus.

متن کامل

Lee-Yang zeros and the Ising model on the Sierpinski Gasket

We study the distribution of the complex temperature zeros for the partition function of the Ising model on a Sierpinski gasket using an exact recursive relation. Although the zeros arrange on a curve pinching the real axis at T = 0 in the thermodynamic limit, their density vanishes asymptotically along the curve approaching the origin. This phenomenon explains the coincidence of the low temper...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics & Theoretical Computer Science

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2008